Explicit Solutions for Interval Semidefinite Linear Programs
نویسنده
چکیده
We consider the special class of semidefinite linear programs (IV P ) maximize traceCX subject to L A(X) U, where C,X,L, U are symmetric matrices, A is a (onto) linear operator, and denotes the Löwner (positive semidefinite) partial order. We present explicit representations for the general primal and dual optimal solutions. This extends the results for standard linear programming that appeared in Ben-Israel and Charnes, 1968. This work is further motivated by the explicit solutions for a different class of semidefinite problems presented recently in Yang and Vanderbei, 1993.
منابع مشابه
Robust Semidefinite Programming∗
In this paper, we consider semidefinite programs where the data is only known to belong to some uncertainty set U . Following recent work by the authors, we develop the notion of robust solution to such problems, which are required to satisfy the (uncertain) constraints whatever the value of the data in U . Even when the decision variable is fixed, checking robust feasibility is in general NP-h...
متن کاملA Recurrent Neural Network Model for Solving Linear Semidefinite Programming
In this paper we solve a wide rang of Semidefinite Programming (SDP) Problem by using Recurrent Neural Networks (RNNs). SDP is an important numerical tool for analysis and synthesis in systems and control theory. First we reformulate the problem to a linear programming problem, second we reformulate it to a first order system of ordinary differential equations. Then a recurrent neural network...
متن کاملA semidefinite relaxation scheme for quadratically constrained
Semidefinite optimization relaxations are among the widely used approaches to find global optimal or approximate solutions for many nonconvex problems. Here, we consider a specific quadratically constrained quadratic problem with an additional linear constraint. We prove that under certain conditions the semidefinite relaxation approach enables us to find a global optimal solution of the unde...
متن کاملCutting Plane Methods and Subgradient Methods
Interior point methods have proven very successful at solving linear programming problems. When an explicit linear programming formulation is either not available or is too large to employ directly, a column generation approach can be used. Examples of column generation approaches include cutting plane methods for integer programming and decomposition methods for many classes of optimization pr...
متن کاملConditioning of semidefinite programs
This paper studies the conditioning of semidefinite programs by analyzing the effect of small perturbations in problem data on the solution. Under the assumptions of strict complementarity and nondegeneracy, an explicit bound on the change in the solution is derived in a primal-dual framework, using tools from the Kantorovič theory. This approach also quantifies the size of permissible perturba...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1993